Fast computation of general forward gravitation problems
نویسندگان
چکیده
منابع مشابه
Fast Computation of Spectral Densities for Generalized Eigenvalue Problems
The distribution of the eigenvalues of a Hermitian matrix (or of a Hermitian matrix pencil) reveals important features of the underlying problem, whether a Hamiltonian system in physics, or a social network in behavioral sciences. However, computing all the eigenvalues explicitly is prohibitively expensive for real-world applications. This paper presents two types of methods to efficiently esti...
متن کاملProblems in Field Theoretical Approach to Gravitation
We consider gravitational self interaction in the lowest approximation and assume that graviton interacts with gravitational energy-momentum tensor in the same way as it interacts with particles. We show that, using gravitational vertex with a preferred gravitational energy-momentum tensor, it is possible to obtain a metric necessary for explaining perihelion precession. The preferred gravitati...
متن کاملStrange quark matter attached to string cloud in general scalar tensor theory of gravitation
Bianchi type-VI0 space time with strange quark matter attached to string cloud in Nordtvedt [1] general scalar tensor theory of gravitation with the help of a special case proposed by Schwinger [2] is obtained. The field equations have been solved by using the anisotropy feature of the universe in the Bianchi type-VI0 space time. Some important features of the model, thus obtained, have been di...
متن کاملFast computation of the time domain diffusion forward model for optical tomography in the Born approximation
Diffuse optical tomography is an emerging technique for non-invasively measuring in vivo tissue optical properties. The next generation of DOT time domain imaging systems will allow researchers to create three-dimensional (3D) images of blood volume and oxygenation with unprecedented spatial resolution. We consider common semi-infinite and slab geometries, in the Born approximation to the diffu...
متن کاملA fast algorithm for the computation of 2-D forward and inverse MDCT
A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT and IMDCT with block size M×N into four 2-D discrete cosine transforms (DCTs) with block size (M/4)×(N/4). It is based on an algorithm recently presented by Cho [7] for the efficient calculation of one-dimensional MDCT ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Geodesy
سال: 2016
ISSN: 0949-7714,1432-1394
DOI: 10.1007/s00190-016-0900-2